package com.xyhuo.leetcode.november;

/**
 * 使用最小花费爬楼梯
 * https://leetcode.cn/problems/min-cost-climbing-stairs
 *
 * @time 2023/11/22
 */
public class MinCostClimbingStairs {

    public int minCostClimbingStairs(int[] cost) {
        int length = cost.length;
        int[] dp = new int[length + 1];
        for (int i = 2; i <= length; i++) {
            int tmp = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
            dp[i] = tmp;
        }
        return dp[length];
    }
}
